A Maximum-Hamming-Distance-Based Approach to Code Construction for Trellis-Coded Quantization

نویسنده

  • Lorenzo Cappellari
چکیده

A thorough description of trellis-coded quantization as a nearly-optimal source coding system is presented. Trelliscoded quantizers couple traditional quantization techniques with finite state machines to build effective high dimensional vector quantizers. In a trellis-coded quantizer, each transition of the related finite state machine is labeled, by means of a convolutional code, with one of the sub-codebooks obtained by partitioning a single extended codebook. Traditional design approaches take advantage of the duality of trellis-coded quantization with trelliscoded modulation, and are then based on the same empiricallyfound convolutional codes. This paper presents a novel approach to construct effective trellis-coded quantizers, which takes advantage of maximum-Hamming-distance convolutional codes. The objective is to describe a new design technique rather than introduce coding systems with highly improved performance. Nevertheless, examples are presented to illustrate the performance of the proposed trellis-coded quantizers, and they are shown to slightly outperform the trellis-coded quantizers found in the literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes

Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empiricallyfound convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamming-distance convolutional codes. The proposed source codes are shown to be co...

متن کامل

Trellis-coded differential unitary space-time modulation over flat fading channels

Coding and modulation for multiple-antenna systems have gained much attention in wireless communications. This paper investigates a non-coherent trellis coded scheme based on differential unitary spacetime modulation when neither the transmitter nor the receiver know the channel. In a time-varying flat Rayleigh fading environment, we derive differentially non-coherent decision metrics and obtai...

متن کامل

Trellis-coded differential unitary space-time modulation in slow flat fading channels with interleaver

This paper considers trellis-coded differential unitary spacetime modulation for multiple-antenna systems when neither the transmitter nor the receiver has access to channel state information. The channel is assumed to be slowly time-varying flat Rayleigh fading with ideal interleaver. We derive the metric for maximum likelihood differential decoding and the Chernoff bound for pair-wise error p...

متن کامل

Trellis-Coded Quadrature Amplitude Modulation with 2N-Dimensional Constellations for Mobile Radio Channels

– Using a modified Wei method, originally designed for AWGN channels, we have constructed fourand six-dimensional trellis codes with rectangular signal constellations for frequency-nonselective mobile radio channels. Applying a novel way of partitioning the 2-D constituent constellations, both into subsets with enlarged minimum Euclidean distance and subrings including equal energy signal point...

متن کامل

The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes

The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009